Hybrid Heuristic Optimization for Benchmark Datasets
نویسندگان
چکیده
This paper introduces hybridization of particle swarm optimization (PSO) with genetic algorithm (GA) denoted as PSO+GA provides an efficient approach which is used to solve non linear chaotic datasets. The proposed algorithm employed in probabilistic neural network(PNN) which is a variant of radial basic function artificial neural network (RBFANN) for finding precise value spread factor for accurate classification of chaotic time series. Hybridizing of particle swarm optimization (PSO) and genetic algorithm (GA) in social learning helps collective efficiency, robustness and global effectiveness. The hybrid approached which then is resulted in the integrated framework for complete determination of spread factor with evaluation parameters. The algorithm is tested on two benchmark problems and compared the performance with arbitrary spread factor of PNN. The results showed that the PSO+GA based heuristic optimization algorithm outperform in terms of higher classification and prediction accuracies with short computation time.
منابع مشابه
A novel hybrid meta-heuristic technique applied to the well-known benchmark optimization problems
In this paper, a hybrid meta-heuristic algorithm, based on imperialistic competition algorithm (ICA), harmony search (HS), and simulated annealing (SA) is presented. The body of the proposed hybrid algorithm is based on ICA. The proposed hybrid algorithm inherits the advantages of the process of harmony creation in HS algorithm to improve the exploitation phase of the ICA algorithm. In addition...
متن کاملHybrid Meta-heuristic Algorithm for Task Assignment Problem
Task assignment problem (TAP) involves assigning a number of tasks to a number of processors in distributed computing systems and its objective is to minimize the sum of the total execution and communication costs, subject to all of the resource constraints. TAP is a combinatorial optimization problem and NP-complete. This paper proposes a hybrid meta-heuristic algorithm for solving TAP in a ...
متن کاملA hybrid metaheuristic using fuzzy greedy search operator for combinatorial optimization with specific reference to the travelling salesman problem
We describe a hybrid meta-heuristic algorithm for combinatorial optimization problems with a specific reference to the travelling salesman problem (TSP). The method is a combination of a genetic algorithm (GA) and greedy randomized adaptive search procedure (GRASP). A new adaptive fuzzy a greedy search operator is developed for this hybrid method. Computational experiments using a wide range of...
متن کاملSIMULTANOUS OPTIMIZATION OF SIZE AND CONNECTION ARRANGEMENT FOR LOW-RISE STEEL PLATE SHEAR WALL SYSTEMS
The present study is concerned with the simultaneous optimization of the size of components and the arrangement of connections for performance-based seismic design of low-rise SPSWs. Design variables include the size of beams and columns, the thickness of the infill panels, the type of each beam-to-column connection and the type of each infill-to-boundary frame connection. The objective functio...
متن کاملA HYBRID CHARGED SYSTEM SEARCH - FIREFLY ALGORITHM FOR OPTIMIZATION OF WATER DISTRIBUTION NETWORKS
Water distribution networks are one of the important and costly infrastructures of cities and many meta-heuristic algorithms in standard or hybrid forms were used for optimizing water distribution networks. These algorithms require a large amount of computational cost. Therefore, the converging speed of algorithms toward the optimization goal is as important as the goal itself. In this paper, a...
متن کامل